Communication Protocols for Secure Distributed Computation of Binary Functions
نویسندگان
چکیده
منابع مشابه
Communication Protocols for Secure Distributed Computation of Binary Functions
A common task in parallel processing is the distributed computation of a function by a number of processors, each of which possesses partial information relevant to the value of that function. In this paper we develop communication protocols which allow for such computation to take place while maintaining the value of the function secret to an eavesdropper. Of interest is the communication comp...
متن کاملDesigning Fully Secure Protocols for Secure Two-Party Computation of Constant-Domain Functions
In a sense, a two-party protocol achieves fairness if the output from the computation is obtained simultaneously by both parties. A seminal result by Cleve (STOC 1986) states that fairness is impossible, in general. Surprisingly, Gordon et al. (JACM 2011) showed that there exist interesting functions that are computable with fairness. The two results give rise to a distinction between fair func...
متن کاملSecure Distributed Human Computation
This paper introduces a line of research on secure distributed human computation. We consider the general paradigm of using large-scale distributed computation to solve difficult problems, but where humans can act as agents and provide candidate solutions. We are especially motivated by problem classes that appear to be difficult for computers to solve effectively, but are easier for humans to ...
متن کاملQuantum Cryptographic Protocols for Secure Communication
Quantum Cryptography offers a secure method of sharing sequences of random numbers to be used as cryptographic keys. It can potentially eliminate many of the weaknesses of classical cryptographic methods. In this paper, we survey some results in quantum cryptography. After a brief introduction to classical cryptography, some fundamental quantum key distribution protocols are reviewed. The issue...
متن کاملOn Necessary Conditions for Secure Distributed Computation
What assumptions are required to achieve an unconditionally secure distributed circuit evaluation in a fully connected network? This question was addressed with respect to the allowed number of malicious players [BGW, CCD, RB], given that every channel is unconditionally secure. In this paper we investigate whether the security of all channels is also a necessary condition. [BGW, CCD] showed ho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2000
ISSN: 0890-5401
DOI: 10.1006/inco.2000.2865